An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
نویسندگان
چکیده
Many scientific applications require one to solve successively linear systems Ax = b with different right-hand sides b and a symmetric positive definite matrix A. The conjugate gradient method applied to the first system generates a Krylov subspace which can be efficiently recycled thanks to orthogonal projections in subsequent systems. A modified conjugate gradient method is then applied with a specific initial guess and initial descent direction and a modified descent direction during the iterations. This paper gives new theoretical results for this method and proposes a new version. Numerical experiments show the efficacy of our method even for quite different right-hand sides.
منابع مشابه
A Class of Nested Iteration Schemes for Generalized Coupled Sylvester Matrix Equation
Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...
متن کاملOn solving sparse symmetric linear systems whose definiteness is unknown
Solving a large, sparse, symmetric linear system Ax = b iteratively must use appropriate methods. The conjugate gradient (CG) method can break down if A is indefinite while algorithms such as SYMMLQ and MINRES, though stable for indefinite systems, are computationally more expensive than CG when applied to positive definite matrices. In this paper, we present an iterative method for the case wh...
متن کاملConjugate gradient method for fuzzy symmetric positive definite system of linear equations
In this paper the conjugate gradient method, for solving fuzzy symmetric positive definite system of linear equation is considered. The method in detail is discussed and followed by convergence theorem and illustrated by solving some numerical examples. 2005 Elsevier Inc. All rights reserved.
متن کاملA Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations
We consider a generalized conjugate gradient method for solving sparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations. The method is based on splitting off from the original coefficient matrix a symmetric, positive-definiteonethat corresponds to a more easily solv...
متن کاملA Chebyshev-based two-stage iterative method as an alternative to the direct solution of linear systems
We consider the solution of ill-conditioned symmetric and positive definite large sparse linear systems of equations. These arise, for instance, when using some symmetrizable preconditioning technique for solving a general (possibly unsymmetric) ill-conditioned linear system, or in domain decomposition of a numerically difficult elliptic problem. We are also concerned with the consecutive solut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 21 شماره
صفحات -
تاریخ انتشار 2000